Spectral Graph Theory ( revised , 2006 )
نویسنده
چکیده
منابع مشابه
Spectral graph theory: Three common spectra∗
In this first talk we will introduce three of the most commonly used types of matrices in spectral graph theory. They are the adjacency matrix, the combinatorial Laplacian, and the normalized Laplacian. We also will give some simple examples of how the spectrum can be used for each of these types.
متن کاملSpectral graph theory: Cheeger constants and discrepancy∗
In this third talk we will discuss properties related to edge expansion. In particular, we will define the Cheeger constant (which measures how easy it is to cut off a large piece of the graph) and state the Cheeger inequalities. We also will define and discuss discrepancy for undirected and directed graphs. We also state the Perron-Frobenius Theorem which is a useful tool in spectral graph the...
متن کاملGraph-based LearningModels for Information Retrieval: A Survey
3 Graph Analysis 6 3.1 Analysis Based on Spectral Graph Theory . . . . . . . . . . . . . 7 3.2 Analysis Based on Random Field Theory . . . . . . . . . . . . . . 9 3.2.1 Markov Random Fields . . . . . . . . . . . . . . . . . . . . 9 3.2.2 Conditional Random Fields . . . . . . . . . . . . . . . . . 10 3.2.3 Gaussian Random Fields . . . . . . . . . . . . . . . . . . . 11 3.3 Analysis Based onMatri...
متن کاملDynamic Spectral Layout with an Application to Small Worlds
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models. Article Type Communicated by Submitted Revised Regular paper P. Eades and P. Healy January 2006 January...
متن کاملSpectral graph theory: Applications of Courant-Fischer∗
In this second talk we will introduce the Rayleigh quotient and the CourantFischer Theorem and give some applications for the normalized Laplacian. Our applications will include structural characterizations of the graph, interlacing results for addition or removal of subgraphs, and interlacing for weak coverings. We also will introduce the idea of “weighted graphs”.
متن کامل